منابع مشابه
Query Ordering Based Top-k Algorithms for Qualitatively Specified Preferences
Preference modelling and management has attracted considerable attention in the areas of Databases, Knowledge Bases and Information Retrieval Systems in recent years. This interest stems from the fact that a rapidly growing class of untrained lay users confront vast data collections, usually through the Internet, typically lacking a clear view of either content or structure, moreover, not even ...
متن کاملTop-k Selection based on Adaptive Sampling of Noisy Preferences
We consider the problem of reliably selecting an optimal subset of fixed size from a given set of choice alternatives, based on noisy information about the quality of these alternatives. Problems of similar kind have been tackled by means of adaptive sampling schemes called racing algorithms. However, in contrast to existing approaches, we do not assume that each alternative is characterized by...
متن کاملApproximate K Nearest Neighbors in High Dimensions
Given a set P of N points in a ddimensional space, along with a query point q, it is often desirable to find k points of P that are with high probability close to q. This is the Approximate k-NearestNeighbors problem. We present two algorithms for AkNN. Both require O(Nd) preprocessing time. The first algorithm has a query time cost that is O(d+logN), while the second has a query time cost that...
متن کاملOn k-Median clustering in high dimensions
We study approximation algorithms for k-median clustering. We obtain small coresets for k-median clustering in metric spaces as well as in Euclidean spaces. Specifically, in IR, those coresets are of size with only polynomial dependency on d. This leads to a (1 + ε)-approximation algorithm for kmedian clustering in IR, with running time O(ndk + 2 O(1) dn), for any σ > 0. This is an improvement ...
متن کاملMinig Top-K High Utility Itemsets - Report
Utility mining, which refers to the discovery of itemsets with utilities higher than a user-specified minimum utility threshold, is an important task and has a wide range of applications, especially in e-commerce. But setting an appropriate minimum utility threshold is a difficult problem. If the minimum threshold is set to low, too many high utility itemsets will be generated and it takes a lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2016
ISSN: 1041-4347
DOI: 10.1109/tkde.2015.2451630